| 翻訳と辞書 |
| greedy embedding ： ウィキペディア英語版 |
greedy embedding
In distributed computing and geometric graph theory, greedy embedding is a process of assigning coordinates to the nodes of a telecommunications network in order to allow greedy geographic routing to be used to route messages within the network. Although greedy embedding has been proposed for use in wireless sensor networks, in which the nodes already have positions in physical space, these existing positions may differ from the positions given to them by greedy embedding, which may in some cases be points in a virtual space of a higher dimension, or in a non-Euclidean geometry. In this sense, greedy embedding may be viewed as a form of graph drawing, in which an abstract graph (the communications network) is embedded into a geometric space.
The idea of performing geographic routing using coordinates in a virtual space, instead of using physical coordinates, is due to Rao et al.〔 Subsequent developments have shown that every network has a greedy embedding with succinct vertex coordinates in the hyperbolic plane, that certain graphs including the polyhedral graphs have greedy embeddings in the Euclidean plane, and that unit disk graphs have greedy embeddings in Euclidean spaces of moderate dimensions with low stretch factors.
==Definitions==
In greedy routing, a message from a source node ''s'' to a destination node ''t'' travels to its destination by a sequence of steps through intermediate nodes, each of which passes the message on to a neighboring node that is closer to ''t''. If the message reaches an intermediate node ''x'' that does not have a neighbor closer to ''t'', then it cannot make progress and the greedy routing process fails. A greedy embedding is an embedding of the given graph with the property that a failure of this type is impossible. Thus, it can be characterized as an embedding of the graph with the property that for every two nodes ''x'' and ''t'', there exists a neighbor ''y'' of ''x'' such that ''d''(''x'',''t'') > ''d''(''y'',''t''), where ''d'' denotes the distance in the embedded space.〔
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「greedy embedding」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|